Greedy pebbling for proof space compression
نویسندگان
چکیده
منابع مشابه
Proof methods and greedy algorithms
This lecture in some ways covers two separate topics: (1) how to prove algorithms correct, in general, using induction; and (2) how to prove greedy algorithms correct. Of course, a thorough understanding of induction is a foundation for the more advanced proof techniques, so the two are related. Note also that even though these techniques are presented more or less as “after the fact” methods o...
متن کاملResolution Proof Transformation for Compression and Interpolation
Verification methods based on SAT, SMT, and Theorem Proving often rely on proofs of unsatisfiability as a powerful tool to extract information in order to reduce the overall effort. For example a proof may be traversed to identify a minimal reason that led to unsatisfiability, for computing abstractions, or for deriving Craig interpolants. In this paper we focus on two important aspects that co...
متن کاملAn approximation to the greedy algorithm for differential compression
We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. The term ‘‘differential compression’’ refers to encoding a file (a version file) as a set of changes with respect to another file (a reference file). Previous differential compression algorithms can be shown empirically to run in linear time, but they have ce...
متن کاملCumulative Space in Black-White Pebbling and Resolution
We study space complexity and time-space trade-offs with a focus not on peak memory usage but on overall memory consumption throughout the computation. Such a cumulative space measure was introduced for the computational model of parallel black pebbling by [Alwen and Serbinenko ’15] as a tool for obtaining results in cryptography. We consider instead the nondeterministic black-white pebble game...
متن کاملThe Complexity of Pebbling and Cover Pebbling
This paper discusses the complexity of graph pebbling, dealing with both traditional pebbling and the recently introduced game of cover pebbling. Determining whether a configuration is solvable according to either the traditional definition or the cover pebbling definition is shown to be NP -complete. The problem of determining the cover pebbling number for an arbitrary demand configuration is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2017
ISSN: 1433-2779,1433-2787
DOI: 10.1007/s10009-017-0459-0